1 results
8 - Cryptography and Game Theory
- from I - Computing in Games
-
- By Yevgeniy Dodis, Department of Computer Science Courant Institute of Mathematical Sciences, New York University, Tal Rabin, T. J. Watson Research Center IBM
- Edited by Noam Nisan, Hebrew University of Jerusalem, Tim Roughgarden, Stanford University, California, Eva Tardos, Cornell University, New York, Vijay V. Vazirani, Georgia Institute of Technology
-
- Book:
- Algorithmic Game Theory
- Published online:
- 31 January 2011
- Print publication:
- 24 September 2007, pp 181-206
-
- Chapter
- Export citation
-
Summary
Abstract
The Cryptographic and Game Theory worlds seem to have an intersection in that they both deal with an interaction between mutually distrustful parties which has some end result. In the cryptographic setting the multiparty interaction takes the shape of a set of parties communicating for the purpose of evaluating a function on their inputs, where each party receives at the end some output of the computation. In the game theoretic setting, parties interact in a game that guarantees some payoff for the participants according to the joint actions of all the parties, while the parties wish to maximize their own payoff. In the past few years the relationship between these two areas has been investigated with the hope of having cross fertilization and synergy. In this chapter we describe the two areas, the similarities and differences, and some of the new results stemming from their interaction.
The first and second section will describe the cryptographic and the game theory settings (respectively). In the third section we contrast the two settings, and in the last sections we detail some of the existing results.
Cryptographic Notions and Settings
Cryptography is a vast subject requiring its own book. Therefore, in the following we will give only a high-level overview of the problem of Multi-Party Computation (MPC), ignoring most of the lower-level details and concentrating only on aspects relevant to Game Theory.